Improved Slime mould algorithm using logical chaos perturbation and reference point non-dominated sorting for multi-objective optimization

نویسندگان

چکیده

Slime Mould Algorithm (SMA) has been widely noticed by researchers for its powerful multi-point search capability and simple feasible structure, many advanced versions of SMA have also proposed. However, most existing methods focus on the single-objective research domain, multi-objective remains relatively scarce; moreover, basic lacks global capability, extension to domain easily leads loss solution diversity. Therefore, in this paper, we propose a general framework which utilises logical chaotic single-dimensional perturbation mechanism increase traversal individuals decision space; secondly, non-dominated sorting based reference point is used select more diverse solutions participate next generation evolution. Through experiments with seven algorithms such as CMOPSO, NSGA-II, NSGA-III, MOEAD, PSEA-II, SPEA-II NSLS 28 basis functions, results show that achieves best convergence, accuracy

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem

Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...

متن کامل

Multi-objective robust optimization model for social responsible closed-loop supply chain solved by non-dominated sorting genetic algorithm

In this study a supply chain network design model has been developed considering both forward and reverse flows through the supply chain. Total Cost, environmental factors such as CO2 emission, and social factors such as employment and fairness in providing job opportunities are considered in three separate objective functions. The model seeks to optimize the facility location proble...

متن کامل

Multi-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm

The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...

متن کامل

A New Non-dominated Sorting Genetic Algorithm for Multi-Objective Optimization 85 A New Non-dominated Sorting Genetic Algorithm for Multi-Objective Optimization

Multi-objective optimization (MO) is a highly demanding research topic because many realworld optimization problems consist of contradictory criteria or objectives. Considering these competing objectives concurrently, a multi-objective optimization problem (MOP) can be formulated as finding the best possible solutions that satisfy these objectives under different tradeoff situations. A family o...

متن کامل

Solving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm

This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Access

سال: 2023

ISSN: ['2169-3536']

DOI: https://doi.org/10.1109/access.2023.3280943